Multi-objective vehicle routing with automated negotiation

Abstract This paper investigates a problem that lies at the intersection of three research areas, namely automated negotiation, vehicle routing, and multi-objective optimization. Specifically, it scenario multiple competing logistics companies aim to cooperate by delivering truck loads for one another, in order improve efficiency reduce distance they drive. In do so, these need find ways exchange their such each them individually benefits. We present new heuristic algorithm that, given set orders company, tries all load exchanges are Pareto-optimal rational. Unlike existing approaches, does this without relying on any kind trusted central server, so not disclose private cost models anyone. The idea is can then use negotiation techniques negotiate which will truly be carried out. Furthermore, presents new, multi-objective, variant And/Or search forms part our approach, experiments based real-world data, as well commonly used Li & Lim data set. These show able hundreds solutions within matter minutes. Finally, an experiment with several state-of-the-art algorithms combination viable.